Minimal Tangent Visibility Graphs
نویسندگان
چکیده
منابع مشابه
Fast Edge-Routing for Large Graphs
To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area involves finding shortest paths in a tangent-visibility graph. However, construction of the full tangent-visibility graph is expensive, at least quadratic time in the number of nodes. In this paper we explore two idea...
متن کاملMinimal Submanifolds
Contents 1. Introduction 2 Part 1. Classical and almost classical results 2 1.1. The Gauss map 3 1.2. Minimal graphs 3 1.3. The maximum principle 5 2. Monotonicity and the mean value inequality 6 3. Rado's theorem 8 4. The theorems of Bernstein and Bers 9 5. Simons inequality 10 6. Heinz's curvature estimate for graphs 10 7. Embedded minimal disks with area bounds 11 8. Stable minimal surfaces ...
متن کاملLines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra
Motivated by visibility problems in three dimensions, we investigate the complexity and construction of the set of tangent lines in a scene of three-dimensional polyhedra. We prove that the set of lines tangent to four possibly intersecting convex polyhedra in R3 with a total of n edges consists of Θ(n2) connected components in the worst case. In the generic case, each connected component is a ...
متن کاملHorizontal visibility graphs generated by type-I intermittency.
The type-I intermittency route to (or out of) chaos is investigated within the horizontal visibility (HV) graph theory. For that purpose, we address the trajectories generated by unimodal maps close to an inverse tangent bifurcation and construct their associated HV graphs. We show how the alternation of laminar episodes and chaotic bursts imprints a fingerprint in the resulting graph structure...
متن کاملOrder Types and Visibility Types of Conngurations of Disjoint Convex Plane Sets Order Types and Visibility Types of Conngurations of Disjoint Convex Plane Sets Extended Abstract
We introduce the notions of order type (or: dual arrangement) and visibility type (or: tangent visibility graph) for conngurations of disjoint convex sets in the plane. We develop optimal algorithms for computing and sweeping the order type, and also give a worst case optimal algorithm for computing the tangent visibility graph. The methods are based on a relation, introduced in this paper, bet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994